Output-Sensitive Methods for Rectilinear Hidden Surface Removal
نویسندگان
چکیده
منابع مشابه
Output-Sensitive Methods for Rectilinear Hidden Surface Removal
Mark H. Overmars§ We present an algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering. The time complexity of OUI algorithm is dependent on both the number of input rectangles, n, and on the size of the output, k. Our algorithm obtains a hade-off between these two components, in that its running time is O(r(nI+l/T" + k», where 1 5 r :S log ...
متن کاملDynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra
In this paper we present an output-sensitive algorithm to maintain the view of a set of c-oriented polyhedra under insertions into or deletions from the set. (A set of polyhedra is c-oriented ifthe number of different orientations of its edges is bounded by some constant c.) Cyclic overlap in the scene is aJlowed and the polyhedra may even intersect. The time needed for an update is 0« k + 1) l...
متن کاملOutput-Sensitive Hidden Surface Elimination for Rectangles
We present an algorithm for the well-known bidden·surface elimination problem for redangles, which is also known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1.5 + k), where k is the size of the output (which can be as large as 6(n2 )). For values of kin the range between n1.5jlog nand n2 ,...
متن کاملOutput-Sensitive Hidden Surface EIimination for Rectangles
We present an algorithm for the well-known hidden-surface eIimination problem for rectangles, which is a b known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1mS + k), where k is the size of the output (which can be as large as 0(n’)). For values of k in the range between n’s6/ log n and n2...
متن کاملAn Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in O(log n) steps on the CREW PRAM model with a work bound of O((n + k)polylog(n)) where n and k are the input and output sizes respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data-structures is somewhat novel in the context...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1993
ISSN: 0890-5401
DOI: 10.1006/inco.1993.1059